Note—Some Equivalent Objectives for Dynamic Network Flow Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertain Dynamic Network Flow Problems

In this paper, uncertain dynamic network flow problems (UDNFPs) are formulated, and an algorithm is proposed to solve them by noting that arc capacities are uncertain (may vary with time or not), and flow varies over time in each arc. Here, uncertainty refers to nondeterministic states, in which some factors are uncertain and cannot be determined by the probability theory. Since the uncertainty...

متن کامل

Multicriteria network location problems with sum objectives

In this paper network location problems with several objectives are discussed, where every single objective is a classical median objective function. We will look at the problem of nding Pareto optimal locations and lexicographically optimal locations. It is shown that for Pareto optimal locations in undirected networks no node dominance result can be shown. Structural results as well as eecien...

متن کامل

Multicommodity Network Flow Problems

In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...

متن کامل

Greedy concepts for network flow problems

A directed graph G = ( V , E ) is given by a finite vertex set V and an edge set E C V× V. We choose two distinct vertices s e Vand t~ Vthat we consider as source and sink respectively. A path (from s to t) is a sequence of distinct edges (s, xl ), (xl, Xz) . . . . . (Xrj, Xr), (Xr, t) for some r. Denote by P the set of all such paths. For an edge e e E let PeCP be the set of paths passing thro...

متن کامل

Combinatorial algorithms for inverse network flow problems

An inverse optimization problems is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and xO be a given feasible solution. We want to perturb the cost vector c to d so that x is an optimal solution of P with respect to the cost vector d , and lid clip is minimum, where 11.llp denotes some selected Lp norm. In this pape...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Management Science

سال: 1982

ISSN: 0025-1909,1526-5501

DOI: 10.1287/mnsc.28.1.106